Some Studies of Expectation Maximization Clustering Algorithm to Enhance Performance
نویسندگان
چکیده
Expectation Maximization (EM) is an efficient mixture-model based clustering method. In this paper, authors made an attempt to scale-up the algorithm, by reducing the computation time required for computing quadratic term, without sacrificing the accuracy. Probability density function (pdf) is to be calculated in EM, which involves evaluating quadratic term calculation. Three recursive approaches are introduced for quadratic term computation. As per our observation, the standard EM needs ) ( 2 d O computations for quadratic term computation, where d is number of dimensions. The proposed recursive EM approaches are with time complexity of /2) ( 2 d O for the quadratic term computation.
منابع مشابه
Performance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project
In this article, we explore the theoretical aspects of the expectation maximization algorithm and how it can be applied to estimation of data as a Gaussian mixture model. We form comparisons and show how by the simplification of some parameters we can form the heuristic k-means algorithm. We then demonstrate through the authors’ code several situations where the EM-GMM algorithm performs signif...
متن کاملComparisons Between Data Clustering Algorithms
Clustering is a division of data into groups of similar objects. Each group, called a cluster, consists of objects that are similar between themselves and dissimilar compared to objects of other groups. This paper is intended to study and compare different data clustering algorithms. The algorithms under investigation are: k-means algorithm, hierarchical clustering algorithm, self-organizing ma...
متن کاملOn Initialization of the Expectation- Maximization Clustering Algorithm
Iterative clustering algorithms commonly do not lead to optimal cluster solutions. Partitions that are generated by these algorithms are known to be sensitive to the initial partitions that are fed as an input parameter. A “good” selection of initial partitions is an essential clustering problem. In this paper we introduce a new method for constructing the initial partitions set to be used by t...
متن کاملA Hybrid Approach for Data Clustering using Expectation- Maximization and Parameter Adaptive Harmony Search Algorithm
This paper presents a novel hybrid data clustering algorithm based on parameter adaptive harmony search algorithm. The recently developed parameter adaptive harmony search algorithm (PAHS) is used to refine the cluster centers, which are further used in initializing Expectation-Maximization clustering algorithm. The optimal number of clusters are determined through four well-known cluster valid...
متن کاملSimilarity based clustering using the expectation maximization algorithm
In this paper we present a new approach for clustering data. The clustering metric used is the normalized crosscorrelation, also known as similarity, instead of the traditionally used Euclidean distance. The main advantage of this metric is that it depends on the signal shape rather than its amplitude. Under an assumption of an exponential probability model that has several desirable properties...
متن کامل